Injective Linear Cellular Automata and Sofic Groups

نویسندگان

  • Tullio Ceccherini-Silberstein
  • Michel Coornaert
چکیده

Let V be a finite-dimensional vector space over a field K and let G be a sofic group. We show that every injective linear cellular automaton τ : V G → V G is surjective. As an application, we obtain a new proof of the stable finiteness of group rings of sofic groups, a result previously established by G. Elek and A. Szabó using different methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An "almost dual" to Gottschalk's Conjecture

We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well known dual concept is pre-injectivity: a cellular automaton is pre-injective if distinct asymptotic configurations have distinct images. We prove that pre-injec...

متن کامل

Cellular automata between sofic tree shifts

We study the sofic tree shifts of A ∗ , where Σ∗ is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin automata. We show that if X ⊂ A ∗ is a sofic tree shift, then the configurations in X whose orbit under the shift action is finite are dense in X , and, as a consequence of this, we deduce that every injective cellular automata τ ...

متن کامل

On a Characterization of Locally Finite Groups in Terms of Linear Cellular Automata

We prove that a group G is locally finite if and only if every surjective real (or complex) linear cellular automaton with finite-dimensional alphabet over G is injective.

متن کامل

Cellular Automata on Regular Rooted Trees

We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.

متن کامل

Edge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System

 Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007